Planar Graphs of Maximum Degree Six without 7-cycles are Class One
نویسندگان
چکیده
منابع مشابه
Planar Graphs of Maximum Degree Six without 7-cycles are Class One
It is conjectured by Vizing (1965) that every planar graphs graph G with maximum degree 6 ⩽ ∆ ⩽ 7 is class one. The case ∆ = 7 was confirmed independently by Sanders and Zhao (2001), and by Zhang (2000). In this paper, we prove that every planar graph G with ∆ = 6 and without 7-cycles is class one.
متن کاملClass two 1-planar graphs with maximum degree six or seven
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
متن کاملPlanar graphs without cycles of length from 4 to 7 are 3-colorable
Planar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, it is proved that each proper 3-coloring of a face of length from 8 to 11 in a connected plane graph without cycles of length from 4 to 7 can be extended to a proper 3-coloring of the whole graph. This improves on the previous results on a long standing conjecture of Steinberg. © 2004 Elsevier Inc. All ri...
متن کاملThe maximum degree of random planar graphs
McDiarmid and Reed [‘On the maximum degree of a random planar graph’, Combin. Probab. Comput. 17 (2008) 591–601] showed that the maximum degree Δn of a random labeled planar graph with n vertices satisfies with high probability (w.h.p.) c1 logn < Δn < c2 logn, for suitable constants 0 < c1 < c2. In this paper, we determine the precise asymptotics, showing in particular that w.h.p. |Δn − c logn|...
متن کاملPlanar graphs without 3-, 7-, and 8-cycles are 3-choosable
A graph G is k-choosable if every vertex of G can be properly colored whenever every vertex has a list of at least k available colors. Grötzsch’s theorem states that every planar triangle-free graph is 3-colorable. However, Voigt [13] gave an example of such a graph that is not 3-choosable, thus Grötzsch’s theorem does not generalize naturally to choosability. We prove that every planar triangl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2589